An Algorithm for Constructing Polynomial Systems Whose Solution Space Characterizes Quantum Circuits
نویسندگان
چکیده
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z2 arising when applying the Feynman’s sum-over-paths approach to quantum circuits. The matrix elements determined by a circuit can be computed by counting the number of common roots in Z2 for the polynomial system associated with the circuit. To determine the number of solutions in Z2 for the output polynomial system, one can use the Gröbner bases method and the relevant algorithms for computing Gröbner bases.
منابع مشابه
Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملProviding a Bird Swarm Algorithm based on Classical Conditioning Learning Behavior and Comparing this Algorithm with sinDE, JOA, NPSO and D-PSO-C Based on Using in Nanoscience
There can be no doubt that nanotechnology will play a major role in our futuretechnology. Computer science offers more opportunities for quantum andnanotechnology systems. Soft Computing techniques such as swarm intelligence, canenable systems with desirable emergent properties. Optimization is an important anddecisive activity in structural designing. The inexpensive re...
متن کاملQUANTUM VERSION OF TEACHING-LEARNING-BASED OPTIMIZATION ALGORITHM FOR OPTIMAL DESIGN OF CYCLIC SYMMETRIC STRUCTURES SUBJECT TO FREQUENCY CONSTRAINTS
As a novel strategy, Quantum-behaved particles use uncertainty law and a distinct formulation obtained from solving the time-independent Schrodinger differential equation in the delta-potential-well function to update the solution candidates’ positions. In this case, the local attractors as potential solutions between the best solution and the others are introduced to explore the solution space...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملA fast wallace-based parallel multiplier in quantum-dot cellular automata
Physical limitations of Complementary Metal-Oxide-Semiconductors (CMOS) technology at nanoscale and high cost of lithography have provided the platform for creating Quantum-dot Cellular Automata (QCA)-based hardware. The QCA is a new technology that promises smaller, cheaper and faster electronic circuits, and has been regarded as an effective solution for scalability problems in CMOS technolog...
متن کامل